Non-representability of finite projective planes by convex sets

نویسنده

  • Martin Tancer
چکیده

We prove that there is no d such that all finite projective planes can be represented by convex sets in R, answering a question of Alon, Kalai, Matoušek, and Meshulam. Here, if P is a projective plane with lines l1, . . . , ln, a representation of P by convex sets in R is a collection of convex sets C1, . . . , Cn ⊆ R d such that Ci1 , Ci2 . . . , Cik have a common point if and only if the corresponding lines li1 , . . . , lik have a common point in P. The proof combines a positive-fraction selection lemma of Pach with a result of Alon on “expansion” of finite projective planes. As a corollary, we show that for every d there are 2-collapsible simplicial complexes that are not d-representable, strengthening a result of Matoušek and the author.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the convex hull of projective planes

We study the finite projective planes with linear programming models. We give a complete description of the convex hull of the finite projective planes of order 2. We give some integer linear programming models whose solution are, either a finite projective (or affine) plane of order n, or a (n + 2)-arc.

متن کامل

Mixed-Integer Convex Representability

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer assignments is finite. We develop a characterization for the more general case of unbounded integer variables together with a simple necessary condition for re...

متن کامل

Line Percolation in Finite Projective Planes

We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolating sets and the maximal non-percolating sets. Additional results on the minimal and maximal percolation time as well as on the critical probability in the projective plane are also presented.

متن کامل

ar X iv : q ua nt - p h / 04 09 18 4 v 2 2 5 N ov 2 00 4 Sets of Mutually Unbiased Bases as Arcs in Finite Projective Planes ?

This note is a short conceptual elaboration of the conjecture of Saniga et al (J. Opt. B: Quantum Semiclass. 6 (2004) L19-L20) by regarding a set of mutually unbiased bases (MUBs) in a d-dimensional Hilbert space as an analogue of an arc in a (finite) projective plane of order d. Complete sets of MUBs thus correspond to (d+1)-arcs, i.e., ovals. In the Desarguesian case, the existence of two pri...

متن کامل

Regularity in mixed-integer convex representability

Characterizations of the sets with mixed integer programming (MIP) formulations using only rational linear inequalities (rational MILP representable) and those with formulations that use arbitrary closed convex constraints (MICP representable) were given by Jeroslow and Lowe (1984), and Lubin, Zadik and Vielma (2017). The latter also showed that even MICP representable subsets of the natural nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009